Codes Derived from Binary Goppa Codes
نویسنده
چکیده
We present a new family of binary codes derived from the family of classical Goppa codes. We generalize properties of Goppa codes to this family and deduce bounds on the dimension and on the minimum distance, and the existence of a polynomial-time decoding algorithm up to a constructed error-correcting capability. Asymptotically these codes have the same parameters as Goppa codes.
منابع مشابه
Exponential Sums and Goppa Codes: I
A bound is obtained which generalizes the Carlitz-Uchiyama result, based on a theorem of Bombieri and Weil about exponential sums. This new bound is used to estimate the covering radius of long binary Goppa codes. A new lower bound is also derived on the minimum distance of the dual of a binary Goppa code, similar to that for BCH codes. This is an example of the use of a number-theory bound for...
متن کاملProof of Conjectures on the True Dimension of Some Binary Goppa Codes
There is a classical lower bound on the dimension of a binary Goppa code. We survey results on some specific codes whose dimension exceeds this bound, and prove two conjectures on the true dimension of two classes of such codes.
متن کاملList Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n− p n(n− 2t− 2) errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomialtime list-decoding algorithms for the same codes, the new algorithm corrects approximately t/2n extra errors.
متن کاملClass of Binary Generalized Goppa Codes Perfect in Weighted Hamming Metric
The class of the binary generalized Goppa codes is offered. It is shown that the codes of this class are on the Hamming bound constructed for a weighted metric.
متن کاملOn the Complexity of Decoding Goppa Codes
-It is shown that i) erasures-and-errors decoding of Goppa codes can be done using O(n log2 n) arithmetic operations, ii) long primitive binary Bose-Chaudhuri-Hocquenghem (BCH) codes can be decoded using O(n log n) arithmetic operations, and iii) Justesen’s asymptotically good codes can be decoded using O(n2) bit operations. These results are based on the application of efficient computational ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Probl. Inf. Transm.
دوره 37 شماره
صفحات -
تاریخ انتشار 2001